CLSE: Closed-Loop Symbolic Execution

نویسندگان

  • Rupak Majumdar
  • Indranil Saha
  • K. C. Shashidhar
  • Zilong Wang
چکیده

We present CLSE, a closed-loop symbolic execution engine for control system implementations. CLSE takes as input the description of a physical plant represented by a system of linear ordinary differential equations, the software implementation and execution frequency for a discrete-time controller that senses and actuates the plant, and a time horizon, and symbolically executes the closed-loop system —the combination of the plant and the controller— up to the time horizon. The execution helps capture the bounded-time dynamics of the system in terms of the finite sequences of the plant’s sampled state-sets and symbolic control inputs. We show the use of CLSE in symbolic execution of a set of control systems benchmarks. Using the symbolic execution engine, we also build a robustness analysis tool which computes the maximum deviation of the states of the plant due to measurement uncertainties in the controller up to the time horizon.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbolic Evaluation of Chains of Recurrences for Loop Optimization

This paper presents a novel method for loop optimization that exploits symbolic evaluation of chains of recurrences (CRs). The method generalizes loop induction expression recognition, loop parallelization by induction variable substitution, loop strength reduction , and loop invariant expression elimination (code motion). Symbolic diierencing of loops has been extensively studied by Haghighat ...

متن کامل

A Symbolic Execution Method for Bounds Analysis

Given a program whose loops are bounded, we address the problem of estimating the upper bound of a variable which is monotonically increasing, and its typical application in annotating a program so that bounds analysis produces an estimate of the worst-case resource usage. The method presented is a systematic enumeration of symbolic states of the program. The novelty is twofold: first, we use i...

متن کامل

Efficient Loop Navigation for Symbolic Execution

Symbolic execution is a successful and very popular technique used in software verification and testing. A key limitation of symbolic execution is in dealing with code containing loops. The problem is that even a single loop can generate a huge number of different symbolic execution paths, corresponding to different number of loop iterations and taking various paths through the loop. We introdu...

متن کامل

An automatic parametric approach for WCET analysis of C programs

In this paper, we propose a static worstcase execution time (WCET) analysis approach aimed to automatically extract flow information related to program semantics. This information is used to reduce the overestimation of the calculated WCET. We focus on flow information related to loop bounds and infeasible paths. The approach handles loops with multiple exit conditions and non-rectangular loops...

متن کامل

Loop Invariant Symbolic Execution for Parallel Programs

Techniques for verifying program assertions using symbolic execution exhibit a significant limitation: they typically require that (small) bounds be imposed on the number of loop iterations. For sequential programs, there is a way to overcome this limitation using loop invariants. The basic idea is to assign new symbolic constants to the variables modified in the loop body, add the invariant to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012